Miscellaneous Isabelle/Isar examples for Higher-Order Logic
نویسندگان
چکیده
Isar offers a high-level proof (and theory) language for Isabelle. We give various examples of Isabelle/Isar proof developments, ranging from simple demonstrations of certain language features to a bit more advanced applications. The “real” applications of Isabelle/Isar are found elsewhere.
منابع مشابه
Calculational Reasoning Revisited (An Isabelle/Isar Experience)
We discuss the general concept of calculational reasoning within Isabelle/Isar, which provides a framework for high-level natural deduction proofs that may be written in a human-readable fashion. Setting out from a few basic logical concepts of the underlying meta-logical framework of Isabelle, such as higher-order unification and resolution, calculational commands are added to the basic Isar p...
متن کاملIsabelle, Isar - a versatile environment for human readable formal proof documents
The basic motivation of this work is to make formal theory developments with machine-checked proofs accessible to a broader audience. Our particular approach is centered around the Isar formal proof language that is intended to support adequate composition of proof documents that are suitable for human consumption. Such primary proofs written in Isar may be both checked by the machine and read ...
متن کاملHigher Order Rippling in IsaPlanner
We present an account of rippling with proof critics suitable for use in higher order logic in Isabelle/IsaPlanner. We treat issues not previously examined, in particular regarding the existence of multiple annotations during rippling. This results in an efficient mechanism for rippling that can conjecture and prove needed lemmas automatically as well as present the resulting proof plans as Isa...
متن کاملStructured Induction Proofs in Isabelle/Isar
Isabelle/Isar is a generic framework for human-readable formal proof documents, based on higher-order natural deduction. The Isar proof language provides general principles that may be instantiated to particular object-logics and applications. We discuss specific Isar language elements that support complex induction patterns of practical importance. Despite the additional bookkeeping required f...
متن کاملFormalizing Integration Theory with an Application to Probabilistic Algorithms
Inter alia, Lebesgue-style integration plays a major role in advanced probability. We formalize a significant part of its theory in Higher Order Logic using the generic interactive theorem prover Isabelle/Isar. This involves concepts of elementary measure theory, real-valued random variables as Borelmeasurable functions, and a stepwise inductive definition of the integral itself. Building on pr...
متن کامل